hip.util.data_structures

Undocumented in source.

Members

Array2D_GC class Array2D_GC(T): Undocumented in source.
EventQueue class EventQueue: High efficient(at least memory-wise), tightly packed Input queue that supports any kind of data in a single allocated memory pool(no fragmentation).
Node class Node(T): Undocumented in source.

DirtyFlagFields mixintemplate DirtyFlagFields(string flagName, T, string[] fields): Undocumented in source.

Array struct Array(T): RefCounted, Array @nogc, OutputRange compatible, it aims to bring the same result as one would have by using int[], Array!int should be equivalent, any different behaviour should be contacted. It may use more memory than requested for not making reallocation a big bottleneck
Array2D struct Array2D(T): By using Array2D instead of T[][], only one array instance is created, not "n" arrays. So it is a lot faster when you use that instead of array of arrays.
Dirty struct Dirty(T): Undocumented in source.
DirtyFlagsCmp struct DirtyFlagsCmp(alias flag, Fields...): Undocumented in source.
Map struct Map(K, V): Undocumented in source.
Pair struct Pair(A, B, string aliasA = "", string aliasB = ""): Undocumented in source.
RangeMap struct RangeMap(K, V): RangeMap allows specifying a range in which a value spams, quite useful for defining outcomes based on an input, experience gain progression, etc. Example Usage:
RingBuffer struct RingBuffer(T, uint Length): Undocumented in source.
Signal struct Signal(A...): Undocumented in source.
String (from hip.util.string) struct String via public import hip.util.string : String;: RefCounted, @nogc string, OutputRange compatible,